Stability of a majority efficient solution of a vector linear trajectorial problem
نویسندگان
چکیده
The multicriteria problem of majority choice on a system of subsets of a finite set with linear partial criteria (MINSUM) is considered. Sufficient and necessary conditions of preserving majority efficiency by an efficient trajectory under " small " perturbations of vector criterion coefficients have been found. Lower and upper attainable estimates of the stability radius of a majority efficient trajectory have been obtained. In the papers [1,2] stability of different types of efficient solutions (optimal by Pareto, Smale, and Slater) of a vector trajectorial problem was investigated. Sufficient and necessary conditions of local stability (the property of a trajectory to preserve appropriate efficiency under " small " independent perturbations of vector criterion parameters) of such solutions were presented. Lower attainable estimates of stability radii of such trajectories, and formulas in several cases, were obtained. A summary of these results can be found in [3]. In this work the parralel results have been obtained for a majority efficient solution being an element of the Pareto set. Note that the papers [4–14] are devoted to various types of stability of the whole Pareto set of vector discrete optimization problems. 1 Definitions and properties As in [1], we consider a class of vector discrete optimization problems described with the following model.
منابع مشابه
Numerical measure of strong stability and strong quasistability in the vector problem of integer linear programming
In this paper we consider a vector integer programming problem with the linear partial criteria. Numerical evaluations of two types of stability of the Pareto set have been found. Usually the stability (quasistability) of a vector optimization problem (see [1-10]) is understood as the property of nonappearance of new optimal solutions (preservation of initial) under small perturbations of the p...
متن کاملQuasi-stability of a vector trajectorial problem with non-linear partial criteria
Multi-objective (vector) combinatorial problem of finding the Pareto set with four kinds of non-linear partial criteria is considered. Necessary and sufficient conditions of that kind of stability of the problem (quasi-stability) are obtained. The problem is a discrete analogue of the lower semicontinuity by Hausdorff of the optimal mapping. Mathematics Subject Classification 2000: 90C10, 90C05...
متن کاملHölder continuity of solution maps to a parametric weak vector equilibrium problem
In this paper, by using a new concept of strong convexity, we obtain sufficient conditions for Holder continuity of the solution mapping for a parametric weak vector equilibrium problem in the case where the solution mapping is a general set-valued one. Without strong monotonicity assumptions, the Holder continuity for solution maps to parametric weak vector optimization problems is discussed.
متن کاملStability, pseudostability and quasistability of vector trajectorial lexicographic optimization problem
Lower bounds of stability, pseudostability and quasistability radii of lexicographic set in vector combinatorial problem on systems of subsets of finite set with partial criteria of more general kinds have been found. Many specialists are engaged in study of stability of discrete optimization problems to perturbations of their parameters (see [1-3]). Need for investigation of stability of optim...
متن کاملAn L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 7 شماره
صفحات -
تاریخ انتشار 1999